Convex Conditions on Decentralized Control for Graph Topology Preservation
نویسندگان
چکیده
منابع مشابه
Thinning algorithms based on sufficient conditions for topology preservation
Description: Thinning is a widely used pre–processing step in digital image processing and pattern recognition. It is an iterative layer by layer erosion until only the "skeletons" of the objects are left. Thinning algorithms are generally constructed in the following way: first the thinning strategy and the deletion rules are figured out, then the topological correctness is proved. In the case...
متن کاملLMI conditions for topology preservation: applications to multi-agent tasks
In this work we present several implementation strategies answering to different classical problems in multi-agent systems. The model under consideration consists of a discrete-time dynamics multi-agent system in which two agents are able to communicate when an algebraic relation between their states is satisfied. As emphasized in the literature, the connectivity of the communication network is...
متن کاملDecentralized Systems for Privacy Preservation
This report documents the program and the outcomes of Dagstuhl Seminar 13062 “Decentralized Systems for Privacy Preservation”. In recent years, a number of concerns have risen about the existence of large, organizationally centralized online services (cloud services, online social networks, repositories, etc). The concerns include risks to users’ data from organizational failures and threats to...
متن کاملOn Topology Preservation for Triangular Thinning Algorithms
Thinning is a frequently used strategy to produce skeletonlike shape features of binary objects. One of the main problems of parallel thinning is to ensure topology preservation. Solutions to this problem have been already given for the case of orthogonal and hexagonal grids. This work introduces some characterizations of simple pixels and some sufficient conditions for parallel thinning algori...
متن کامل2D Parallel Thinning and Shrinking Based on Sufficient Conditions for Topology Preservation
Thinning and shrinking algorithms, respectively, are capable of extracting medial lines and topological kernels from digital binary objects in a topology preserving way. These topological algorithms are composed of reduction operations: object points that satisfy some topological and geometrical constraints are removed until stability is reached. In this work we present some new sufficient cond...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2014
ISSN: 0018-9286,1558-2523
DOI: 10.1109/tac.2013.2292719